One-Probe Search
نویسندگان
چکیده
We consider dictionaries that perform lookups by probing a single word of memory, knowing only the size of the data structure. We describe a randomized dictionary where a lookup returns the correct answer with probability 1− , and otherwise returns “don’t know”. The lookup procedure uses an expander graph to select the memory location to probe. Recent explicit expander constructions are shown to yield space usage far smaller than what would be required using a deterministic lookup procedure. Our data structure supports efficient deterministic updates, exhibiting new probabilistic guarantees on dictionary running
منابع مشابه
A two-stage search of visual working memory: investigating speed in the change-detection paradigm.
A popular procedure for investigating working memory processes has been the visual change-detection procedure. Models of performance based on that procedure, however, tend to be based on performance accuracy and treat working memory search as a one-step process, in which memory representations are compared to a test probe to determine if a match is present. To gain a clearer understanding of ho...
متن کاملIntegration of a Refinement Solver and a Local-Search Solver
We describe an integration of a refinement solver and a local-search solver for constraint satisfaction, with the goal to use information from the local-search solution process as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next refinement step is based on an interposed phase of constructing/revising a complete (but not necessarily feas...
متن کاملParallel inhibitory marking in visual search
The experiment reported in this chapter examined inhibitory selection in parallel visual search (Müller & von Mühlenen, 2000). In a dual-task paradigm, participants had to search for a target amongst distractors in a “pop-out” search task. Distractor inhibition was measured using a probe-stimulus method: A simple luminance increment (probe) followed the search task response at display locations...
متن کاملTop-down inhibition of search distractors in parallel visual search.
In three experiments, we examined distractor inhibition in parallel ("pop-out") visual search. Distractor inhibition was measured in terms of reaction time (RT) to a simple luminance increment probe presented, after the search task response, at display locations that either contained a search distractor (on-probe) or were blank (off-probe). When the search stimuli remained in view, the on-probe...
متن کاملNon-Adaptive Data Structure Bounds for Dynamic Predecessor Search
In this work, we continue the examination of the role non-adaptivity plays in maintaining dynamic data structures, initiated by Brody and Larsen. We consider non-adaptive data structures for predecessor search in the w-bit cell probe model. In this problem, the goal is to dynamically maintain a subset T of up to n elements from t1, . . . ,mu, while supporting insertions, deletions, and a predec...
متن کاملIntegrating Local-Search Advice Into Refinement Search (Or Not)
Recent work has shown the promise in using local-search “probes” as a basis for directing a backtracking-based refinement search. In this approach, the decision about the next refinement step is based on an interposed phase of constructing a complete (but not necessarily feasible) variable assignment. This assignment is then used to decide on which refinement to take, i.e., as a kind of variabl...
متن کامل